A geometric framework for sparse matrix problems
نویسندگان
چکیده
منابع مشابه
A geometric framework for sparse matrix problems
In this paper, we set up a geometric framework for solving sparse matrix problems. We introduce geometric sparseness, a notion which applies to several well-known families of sparse matrix. Two algorithms are presented for solving geometrically-sparse matrix problems. These algorithms are inspired by techniques in classical algebraic topology, and involve the construction of a simplicial comple...
متن کاملA geometric framework for resource allocation problems
In a wide variety of industrial problems, a geographic region must be segmented into smaller regions to allocate resources. This is often done using combinatorial devices that discard the underlying geometry of the problem. In this paper we describe a geometric framework, map segmentation, for solving such problems and give several practical examples demonstrating the efficacy of such approaches.
متن کاملDecomposition Methods for Sparse Matrix Nearness Problems
We discuss three types of sparse matrix nearness problems: given a sparse symmetric matrix, find the matrix with the same sparsity pattern that is closest to it in Frobenius norm and (1) is positive semidefinite, (2) has a positive semidefinite completion, or (3) has a Euclidean distance matrix completion. Several proximal splitting and decomposition algorithms for these problems are presented ...
متن کاملSparsity: Optimization Framework for Sparse Matrix Kernels
Sparse matrix-vector multiplication is an important computational kernel that performs poorly on most modern processors due to a low compute-to-memory ratio and irregular memory access patterns. Optimization is difficult because of the complexity of cache-based memory systems and because performance is highly dependent on the nonzero structure of the matrix. The Sparsity system is designed to a...
متن کاملRun-Time Techniques for Parallelizing Sparse Matrix Problems
Sparse matrix problems are diicult to parallelize eeciently on message-passing machines, since they access data through multiple levels of indirection. Inspectorrexecutor strategies, which are typically used to parallelize such problems impose signiicant preprocessing overheads. This paper describes the runtime support required by new compilation techniques for sparse matrices and evaluates the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2004
ISSN: 0196-8858
DOI: 10.1016/j.aam.2003.08.002